1988-A Note on Probabilistic Logic

نویسندگان

  • Mary McLeish
  • Nils Nilsson
  • N. Nilsson
چکیده

This paper answers a question posed by Nils Nilsson in his paper [9] on Probabilistic Logic: When is the maximum entropy solution to the entailment problem equal to the solution obtained by the projection method? Conditions are given for the relevant matrices and vectors which can be tested without actually computing the two solutions and comparing them. Examples are discussed and some comments made concerning the use and computational problems of probabilistic logic.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Design Methodology for Reliable MRF-Based Logic Gates

Probabilistic-based methods have been used for designing noise tolerant circuits recently. In these methods, however, there is not any reliability mechanism that is essential for nanometer digital VLSI circuits. In this paper, we propose a novel method for designing reliable probabilistic-based logic gates. The advantage of the proposed method in comparison with previous probabilistic-based met...

متن کامل

Integrating Logical and Probabilistic Reasoning for Decision Making

We describe a representation and a set of inference methods that combine logic programming techniques with probabilistic network representations for uncertainty (influence diagrams). The techniques emphasize the dynamic construction and solution of probabilistic and decision-theoretic models for complex and uncertain domains. Given a query, a logical proof is produced if possible; if not, an in...

متن کامل

On probability distributions over possible worlds

In Probabilistic Logic Nilsson uses the device of a probability distribution over the set of possible worlds to assign probabilities to the sentences of a logical language. In his paper Nilsson concentrated on inference and associated computational issues. This paper, on the other hand, examines the probabilistic semantics in more detail, particularly for the case of first order languages, and ...

متن کامل

Design of Logic Network for Generating Sequency Ordered Hadamard Matrix H

A logic network to produce the sequency ordered Hadamard matrix H based on the property of gray code and orthogonal group codes is developed. The network uses a counter to generate Rademacher function such that the output of H will be in sequency. A general purpose shift register with output logic is used to establish a sequence of period P corresponding to a given value of order m of the Hadam...

متن کامل

Single Rules form Canonical Logic Programs

It has been conjectured [Blair] that every definite clause logic program containing exactly one rule is canonical. This note presents a simple proof

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999